package top.lcm668.study.oj.base.sortmethods;

import top.lcm668.study.oj.base.sortmethods.mergesort.Down2UpMergeSort;
import top.lcm668.study.oj.base.sortmethods.mergesort.Up2DownMergeSort;

/**
 * @author: Coder-Lcm
 * @date: 2021/10/5 5:36
 */
public class TestSortMethods {
    public static void main(String[] args) {
        Integer[] nums = {1,34,12,67,9,21,33,413,12};
//        Integer[] nums = {1,9,12,12,21,33,34,67,413};
        BaseSort<Integer> sortHandler = null;
//        sortHandler = new BubbleSort<>();
//        sortHandler = new SelectSort<>();
//        sortHandler = new InsertSort<>();
//        sortHandler = new ShellSort<>();
//        sortHandler = new Up2DownMergeSort<>();
//        sortHandler = new Down2UpMergeSort<>();
//        sortHandler = new QuickSort<>();
//        sortHandler = new RadixSort<>();
//        sortHandler = new CountingSort<>();
        sortHandler = new BucketSort<>();

        sortHandler.sort(nums, true);
        sortHandler.print(nums);

    }
}
